Graphs with cycles having adjacent lines different colors
نویسندگان
چکیده
منابع مشابه
Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles
Avoiding Monochromatic Cycles Fabrice Talla Nobibon HEC-Management School, University of Liège, Rue Louvrex 14, Building N1, B-4000 Liège, Belgium, [email protected] Cor A.J. Hurkens Eindhoven University of Technology, Department of Mathematics and Computer Science. P.O. Box 513, 5600 MB Eindhoven, the Netherlands, [email protected] Roel Leus, Frits C.R. Spieksma University of Leuve...
متن کاملIncidence coloring of planar graphs without adjacent small cycles
An incidence of an undirected graph G is a pair (v, e) where v is a vertex of G and e an edge of G incident with v. Two incidences (v, e) and (w, f) are adjacent if one of the following holds: (i) v = w, (ii) e = f or (iii) vw = e or f . An incidence coloring of G assigns a color to each incidence of G in such a way that adjacent incidences get distinct colors. In 2012, Yang [15] proved that ev...
متن کاملGroup edge choosability of planar graphs without adjacent short cycles
In this paper, we aim to introduce the group version of edge coloring and list edge coloring, and prove that all 2-degenerate graphs along with some planar graphs without adjacent short cycles is group (∆(G) + 1)-edgechoosable while some planar graphs with large girth and maximum degree is group ∆(G)-edge-choosable.
متن کاملPaths and cycles with many colors in edge-colored complete graphs
In this paper we consider properly edge-colored complete graphs, i.e. two edges with the same color cannot share an endpoint, so each color class is a matching. A proper edge-coloring is a factorization if each color class is a perfect or near perfect matching. A subgraph is called rainbow if its edges have different colors. We show that in any factorization of the complete graph Kn on n vertic...
متن کاملEdge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
Let G be a planar graph with no two 3-cycles sharing an edge. We show that if ∆(G) ≥ 9, then χ′l(G) = ∆(G) and χ ′′ l (G) = ∆(G) + 1. We also show that if ∆(G) ≥ 6, then χ ′ l(G) ≤ ∆(G) + 1 and if ∆(G) ≥ 7, then χ′′ l (G) ≤ ∆(G) + 2. All of these results extend to graphs in the projective plane and when ∆(G) ≥ 7 the results also extend to graphs in the torus and Klein bottle. This second edge-c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1976
ISSN: 0095-8956
DOI: 10.1016/0095-8956(76)90007-1